graph homomorphism造句

This definition gives rise to the usual notion of graph homomorphism, which has the interesting property that a bijective homomorphism need not be invertible.
A DPO graph transformation system ( or graph grammar ) consists of a finite category of finite graphs and graph homomorphisms, which serve as derivation rules.
If the homomorphism f : G \ rightarrow G'is a bijection whose inverse function is also a graph homomorphism, then f is a graph isomorphism.
Adding any edge to the Moser spindle results in a graph that cannot be embedded in the plane as a unit distance graph, and there does not exist a graph homomorphism from the Moser spindle to any smaller unit distance graph.
Paterson is an expert on theoretical computer science with more than 100 publications, especially the design and analysis of algorithms and Lynch, he received the Dijkstra Prize in 2001, and his work with Dyer and Goldberg on counting graph homomorphisms received a best paper award at the ICALP conference in 2006.
It's difficult to find graph homomorphism in a sentence. 用graph homomorphism造句挺难的

From the perspective of the DPO approach a graph rewriting rule is a pair of morphisms in the category of graphs and graph homomorphisms between them : r = ( L \ leftarrow K \ rightarrow R ) ( or L \ supseteq K \ subseteq R ) where K \ rightarrow L is injective.
Furthermore, the subgraphs of a multigraph are in bijection with the graph homomorphisms from to the multigraph definable as the complete directed graph on two vertices ( hence four edges, namely two self-loops and two more edges forming a cycle ) augmented with a fifth edge, namely a second self-loop at one of the vertices.